Stabilization of monomial maps
نویسندگان
چکیده
منابع مشابه
Degree-growth of Monomial Maps
For projectivizations of rational maps Bellon and Viallet defined the notion of algebraic entropy using the exponential growth rate of the degrees of iterates. We want to call this notion to the attention of dynamicists by computing algebraic entropy for certain rationalmaps of projective spaces (Theorem6.2) and comparing it with topological entropy (Theorem 5.1). The particular rational maps w...
متن کاملMultidegrees of Monomial Rational Maps
We prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes of related polytopes, in the spirit of the classical Bernstein-Kouchnirenko theorem, but extending the scope of these formulas to more general monomial maps. ...
متن کاملCombinatorics of Cremona monomial maps
One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of monomials defining the inverse can be obtained explicitly in terms of the initial data. A neat consequence is drawn for the plane Cremona monomial group, in particu...
متن کاملMonomial Maps and Algebraic Entropy
In this note, we study some of the simplest algebraic self-maps of projective spaces. These maps, which we call monomial maps, are in one-to-one correspondence with nonsingular integer matrices, and are closely related to toral endomorphisms. In Theorem 1 we give a lower bound for the topological entropy of monomial maps and in Theorem 2 we give a formula for algebraic entropy (as defined by Be...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 2011
ISSN: 0026-2285
DOI: 10.1307/mmj/1320763052